A Scheduling Framework for the Automatic Support of Temporal QoS Constraints

This work focuses on the support of applications that must meet temporal QoS constraints. We propose an approach to automatically derive scheduling information from temporal QoS equations expressed at a high level. The application threads are partitioned into finer grain (or elementary) threads to which QoS constraints are applied. The elementary thread decomposition is used to guide the scheduling of the associated user threads. The scheduling framework involves best effort cooperative scheduling based on the Earliest Deadline First (EDF) policy.